<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Copyright (C) 2010 Zhenya Leonov<a name="line.2"></a>
<span class="sourceLineNo">003</span> *<a name="line.3"></a>
<span class="sourceLineNo">004</span> * Licensed under the Apache License, Version 2.0 (the "License");<a name="line.4"></a>
<span class="sourceLineNo">005</span> * you may not use this file except in compliance with the License.<a name="line.5"></a>
<span class="sourceLineNo">006</span> * You may obtain a copy of the License at<a name="line.6"></a>
<span class="sourceLineNo">007</span> *<a name="line.7"></a>
<span class="sourceLineNo">008</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.8"></a>
<span class="sourceLineNo">009</span> *<a name="line.9"></a>
<span class="sourceLineNo">010</span> * Unless required by applicable law or agreed to in writing, software<a name="line.10"></a>
<span class="sourceLineNo">011</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.11"></a>
<span class="sourceLineNo">012</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.12"></a>
<span class="sourceLineNo">013</span> * See the License for the specific language governing permissions and<a name="line.13"></a>
<span class="sourceLineNo">014</span> * limitations under the License.<a name="line.14"></a>
<span class="sourceLineNo">015</span> */<a name="line.15"></a>
<span class="sourceLineNo">016</span><a name="line.16"></a>
<span class="sourceLineNo">017</span>package com.palamida.util.collect;<a name="line.17"></a>
<span class="sourceLineNo">018</span><a name="line.18"></a>
<span class="sourceLineNo">019</span>import static com.google.common.base.Preconditions.checkElementIndex;<a name="line.19"></a>
<span class="sourceLineNo">020</span>import static com.google.common.base.Preconditions.checkNotNull;<a name="line.20"></a>
<span class="sourceLineNo">021</span>import static com.google.common.base.Preconditions.checkPositionIndex;<a name="line.21"></a>
<span class="sourceLineNo">022</span>import static com.google.common.base.Preconditions.checkState;<a name="line.22"></a>
<span class="sourceLineNo">023</span><a name="line.23"></a>
<span class="sourceLineNo">024</span>import java.io.Serializable;<a name="line.24"></a>
<span class="sourceLineNo">025</span>import java.util.AbstractList;<a name="line.25"></a>
<span class="sourceLineNo">026</span>import java.util.ArrayList;<a name="line.26"></a>
<span class="sourceLineNo">027</span>import java.util.Collection;<a name="line.27"></a>
<span class="sourceLineNo">028</span>import java.util.ConcurrentModificationException;<a name="line.28"></a>
<span class="sourceLineNo">029</span>import java.util.Iterator;<a name="line.29"></a>
<span class="sourceLineNo">030</span>import java.util.LinkedList;<a name="line.30"></a>
<span class="sourceLineNo">031</span>import java.util.List;<a name="line.31"></a>
<span class="sourceLineNo">032</span>import java.util.ListIterator;<a name="line.32"></a>
<span class="sourceLineNo">033</span>import java.util.NoSuchElementException;<a name="line.33"></a>
<span class="sourceLineNo">034</span>import java.util.Random;<a name="line.34"></a>
<span class="sourceLineNo">035</span><a name="line.35"></a>
<span class="sourceLineNo">036</span>import com.google.common.base.Objects;<a name="line.36"></a>
<span class="sourceLineNo">037</span>import com.google.common.collect.Iterables;<a name="line.37"></a>
<span class="sourceLineNo">038</span><a name="line.38"></a>
<span class="sourceLineNo">039</span>/**<a name="line.39"></a>
<span class="sourceLineNo">040</span> * A {@code List} optimized for efficient &lt;a<a name="line.40"></a>
<span class="sourceLineNo">041</span> * href="http://en.wikipedia.org/wiki/Random_access"&gt;random access&lt;/a&gt; insertion<a name="line.41"></a>
<span class="sourceLineNo">042</span> * and removal operations. Implements all optional list operations, and permits<a name="line.42"></a>
<span class="sourceLineNo">043</span> * all elements, including {@code null}.<a name="line.43"></a>
<span class="sourceLineNo">044</span> * &lt;p&gt;<a name="line.44"></a>
<span class="sourceLineNo">045</span> * The iterators obtained from the {@link #iterator()} and<a name="line.45"></a>
<span class="sourceLineNo">046</span> * {@link #listIterator()} methods are &lt;i&gt;fail-fast&lt;/i&gt;. Attempts to modify the<a name="line.46"></a>
<span class="sourceLineNo">047</span> * elements in this list at any time after an iterator is created, in any way<a name="line.47"></a>
<span class="sourceLineNo">048</span> * except through the iterator's own remove method, will result in a<a name="line.48"></a>
<span class="sourceLineNo">049</span> * {@code ConcurrentModificationException}.<a name="line.49"></a>
<span class="sourceLineNo">050</span> * &lt;p&gt;<a name="line.50"></a>
<span class="sourceLineNo">051</span> * This list is not &lt;i&gt;thread-safe&lt;/i&gt;. If multiple threads modify this list<a name="line.51"></a>
<span class="sourceLineNo">052</span> * concurrently it must be synchronized externally.<a name="line.52"></a>
<span class="sourceLineNo">053</span> * &lt;p&gt;<a name="line.53"></a>
<span class="sourceLineNo">054</span> * This class implements an array-based &lt;a<a name="line.54"></a>
<span class="sourceLineNo">055</span> * href="http://en.wikipedia.org/wiki/Skip_list"&gt;skip list&lt;/a&gt; modified to<a name="line.55"></a>
<span class="sourceLineNo">056</span> * provide logarithmic running time for linear list operations (e.g. insert an<a name="line.56"></a>
<span class="sourceLineNo">057</span> * element at the i&lt;i&gt;th&lt;/i&gt; index). Linear list operations are sometimes<a name="line.57"></a>
<span class="sourceLineNo">058</span> * referred to as rank operations.<a name="line.58"></a>
<span class="sourceLineNo">059</span> * &lt;p&gt;<a name="line.59"></a>
<span class="sourceLineNo">060</span> * Invented by &lt;a href="http://www.cs.umd.edu/~pugh/"&gt;Bill Pugh&lt;/a&gt; in 1990, A<a name="line.60"></a>
<span class="sourceLineNo">061</span> * skip list is a probabilistic data structure for maintaining items in sorted<a name="line.61"></a>
<span class="sourceLineNo">062</span> * order. Strictly speaking it is impossible to make any hard guarantees<a name="line.62"></a>
<span class="sourceLineNo">063</span> * regarding the worst-case performance of this class. Practical performance is<a name="line.63"></a>
<span class="sourceLineNo">064</span> * &lt;i&gt;expected&lt;/i&gt; to be logarithmic with an extremely high degree of<a name="line.64"></a>
<span class="sourceLineNo">065</span> * probability as the list grows.<a name="line.65"></a>
<span class="sourceLineNo">066</span> * &lt;p&gt;<a name="line.66"></a>
<span class="sourceLineNo">067</span> * The following table summarizes the performance of this class compared to an<a name="line.67"></a>
<span class="sourceLineNo">068</span> * {@link ArrayList} and a {@link LinkedList} (where n is the size of this list<a name="line.68"></a>
<span class="sourceLineNo">069</span> * and &lt;i&gt;m&lt;/i&gt; is the size of the specified collection which is iterable in<a name="line.69"></a>
<span class="sourceLineNo">070</span> * linear time):<a name="line.70"></a>
<span class="sourceLineNo">071</span> * &lt;p&gt;<a name="line.71"></a>
<span class="sourceLineNo">072</span> * &lt;table border cellpadding="3" cellspacing="1" style="width:450px;"&gt;<a name="line.72"></a>
<span class="sourceLineNo">073</span> *   &lt;tr&gt;<a name="line.73"></a>
<span class="sourceLineNo">074</span> *     &lt;th style="text-align:center;" rowspan="2"&gt;Method&lt;/th&gt;<a name="line.74"></a>
<span class="sourceLineNo">075</span> *     &lt;th style="text-align:center;" colspan="3"&gt;Running Time&lt;/th&gt;<a name="line.75"></a>
<span class="sourceLineNo">076</span> *   &lt;/tr&gt;<a name="line.76"></a>
<span class="sourceLineNo">077</span> *   &lt;tr&gt;<a name="line.77"></a>
<span class="sourceLineNo">078</span> *     &lt;td style="text-align:center;"&gt;&lt;b&gt;RankList&lt;/b&gt;&lt;br&gt;(&lt;i&gt;expected&lt;/i&gt;)&lt;/td&gt;<a name="line.78"></a>
<span class="sourceLineNo">079</span> *     &lt;td style="text-align:center;"&gt;&lt;b&gt;ArrayList&lt;/b&gt;&lt;br&gt;(&lt;i&gt;amortized&lt;/i&gt;)&lt;/td&gt;<a name="line.79"></a>
<span class="sourceLineNo">080</span> *     &lt;td style="text-align:center;"&gt;&lt;b&gt;LinkedList&lt;/b&gt;&lt;br&gt;(&lt;i&gt;worst-case&lt;/i&gt;)&lt;/td&gt;<a name="line.80"></a>
<span class="sourceLineNo">081</span> *   &lt;/tr&gt;<a name="line.81"></a>
<span class="sourceLineNo">082</span> *   &lt;tr&gt;<a name="line.82"></a>
<span class="sourceLineNo">083</span> *     &lt;td&gt;<a name="line.83"></a>
<span class="sourceLineNo">084</span> *       {@link #addAll(Collection) addAll(Collection)}<a name="line.84"></a>
<span class="sourceLineNo">085</span> *     &lt;/td&gt;<a name="line.85"></a>
<span class="sourceLineNo">086</span> *     &lt;td style="text-align:center;" bgcolor="FFCC99"&gt;&lt;i&gt;O(m log n)&lt;/i&gt;&lt;/td&gt;<a name="line.86"></a>
<span class="sourceLineNo">087</span> *     &lt;td style="text-align:center;" bgcolor="FFCCCC"&gt;&lt;i&gt;O(m)&lt;/i&gt;&lt;/td&gt;<a name="line.87"></a>
<span class="sourceLineNo">088</span> *     &lt;td style="text-align:center;" bgcolor="9999CC"&gt;&lt;i&gt;O(m)&lt;/i&gt;&lt;/td&gt;<a name="line.88"></a>
<span class="sourceLineNo">089</span> *   &lt;/tr&gt;<a name="line.89"></a>
<span class="sourceLineNo">090</span> *   &lt;tr&gt;<a name="line.90"></a>
<span class="sourceLineNo">091</span> *     &lt;td&gt;<a name="line.91"></a>
<span class="sourceLineNo">092</span> *       {@link #containsAll(Collection) containsAll(Collection)}&lt;br/&gt;<a name="line.92"></a>
<span class="sourceLineNo">093</span> *       {@link #removeAll(Collection) removeAll(Collection)}&lt;br/&gt;<a name="line.93"></a>
<span class="sourceLineNo">094</span> *       {@link #retainAll(Collection) retainAll(Collection)}<a name="line.94"></a>
<span class="sourceLineNo">095</span> *     &lt;/td&gt;<a name="line.95"></a>
<span class="sourceLineNo">096</span> *     &lt;td style="text-align:center;" colspan="3"&gt;&lt;i&gt;O(m * n)&lt;/i&gt;&lt;/td&gt;<a name="line.96"></a>
<span class="sourceLineNo">097</span> *   &lt;/tr&gt;<a name="line.97"></a>
<span class="sourceLineNo">098</span> *     &lt;td&gt;<a name="line.98"></a>
<span class="sourceLineNo">099</span> *       {@link #add(Object) add(E)}<a name="line.99"></a>
<span class="sourceLineNo">100</span> *     &lt;/td&gt;<a name="line.100"></a>
<span class="sourceLineNo">101</span> *     &lt;td style="text-align:center;" rowspan="9" bgcolor="FFCC99"&gt;&lt;i&gt;O(log n)&lt;/i&gt;&lt;/td&gt;<a name="line.101"></a>
<span class="sourceLineNo">102</span> *     &lt;td style="text-align:center;" rowspan="3" bgcolor="FFCCCC"&gt;&lt;i&gt;O(1)&lt;/i&gt;&lt;/td&gt;<a name="line.102"></a>
<span class="sourceLineNo">103</span> *     &lt;td style="text-align:center;" bgcolor="9999CC"&gt;&lt;i&gt;O(1)&lt;/i&gt;&lt;/td&gt;<a name="line.103"></a>
<span class="sourceLineNo">104</span> *   &lt;/tr&gt;<a name="line.104"></a>
<span class="sourceLineNo">105</span> *   &lt;tr&gt;<a name="line.105"></a>
<span class="sourceLineNo">106</span> *     &lt;td&gt;<a name="line.106"></a>
<span class="sourceLineNo">107</span> *       {@link #get(int)}&lt;br/&gt;<a name="line.107"></a>
<span class="sourceLineNo">108</span> *       &lt;td style="text-align:center;" rowspan="5" bgcolor="9999CC"&gt;&lt;i&gt;O(n)&lt;/i&gt;&lt;/td&gt;<a name="line.108"></a>
<span class="sourceLineNo">109</span> *     &lt;/td&gt;<a name="line.109"></a>
<span class="sourceLineNo">110</span> *   &lt;/tr&gt;<a name="line.110"></a>
<span class="sourceLineNo">111</span> *   &lt;tr&gt;<a name="line.111"></a>
<span class="sourceLineNo">112</span> *     &lt;td&gt;<a name="line.112"></a>
<span class="sourceLineNo">113</span> *       {@link #set(int, Object) set(int, E)}<a name="line.113"></a>
<span class="sourceLineNo">114</span> *     &lt;/td&gt;<a name="line.114"></a>
<span class="sourceLineNo">115</span> *   &lt;/tr&gt;<a name="line.115"></a>
<span class="sourceLineNo">116</span> *   &lt;tr&gt;<a name="line.116"></a>
<span class="sourceLineNo">117</span> *     &lt;td&gt;<a name="line.117"></a>
<span class="sourceLineNo">118</span> *       {@link #add(int, Object) add(int, E)}&lt;br/&gt;<a name="line.118"></a>
<span class="sourceLineNo">119</span> *     &lt;/td&gt;<a name="line.119"></a>
<span class="sourceLineNo">120</span> *     &lt;td style="text-align:center;" rowspan="6" bgcolor="FFCCCC"&gt;&lt;i&gt;O(n)&lt;/i&gt;&lt;/td&gt;<a name="line.120"></a>
<span class="sourceLineNo">121</span> *     &lt;/td&gt;<a name="line.121"></a>
<span class="sourceLineNo">122</span> *   &lt;/tr&gt;<a name="line.122"></a>
<span class="sourceLineNo">123</span> *   &lt;tr&gt;<a name="line.123"></a>
<span class="sourceLineNo">124</span> *     &lt;td&gt;<a name="line.124"></a>
<span class="sourceLineNo">125</span> *       {@link #remove(int)}<a name="line.125"></a>
<span class="sourceLineNo">126</span> *     &lt;/td&gt;<a name="line.126"></a>
<span class="sourceLineNo">127</span> *   &lt;/tr&gt;<a name="line.127"></a>
<span class="sourceLineNo">128</span> *   &lt;tr&gt;<a name="line.128"></a>
<span class="sourceLineNo">129</span> *     &lt;td&gt;<a name="line.129"></a>
<span class="sourceLineNo">130</span> *       {@link #listIterator(int)}<a name="line.130"></a>
<span class="sourceLineNo">131</span> *     &lt;/td&gt;<a name="line.131"></a>
<span class="sourceLineNo">132</span> *   &lt;/tr&gt;<a name="line.132"></a>
<span class="sourceLineNo">133</span> *   &lt;tr&gt;<a name="line.133"></a>
<span class="sourceLineNo">134</span> *     &lt;td&gt;{@link Iterator#remove()}&lt;/td&gt;<a name="line.134"></a>
<span class="sourceLineNo">135</span> *     &lt;td style="text-align:center;" rowspan="3" bgcolor="9999CC"&gt;&lt;i&gt;O(1)&lt;/i&gt;&lt;/td&gt;<a name="line.135"></a>
<span class="sourceLineNo">136</span> *   &lt;/tr&gt;<a name="line.136"></a>
<span class="sourceLineNo">137</span> *   &lt;tr&gt;<a name="line.137"></a>
<span class="sourceLineNo">138</span> *     &lt;td&gt;{@link ListIterator#remove()}&lt;/td&gt;<a name="line.138"></a>
<span class="sourceLineNo">139</span> *   &lt;/tr&gt;<a name="line.139"></a>
<span class="sourceLineNo">140</span> *   &lt;tr&gt;<a name="line.140"></a>
<span class="sourceLineNo">141</span> *     &lt;td&gt;{@link ListIterator#add(Object) ListIterator.add(E)}&lt;/td&gt;<a name="line.141"></a>
<span class="sourceLineNo">142</span> *   &lt;/tr&gt;<a name="line.142"></a>
<span class="sourceLineNo">143</span> *   &lt;tr&gt;<a name="line.143"></a>
<span class="sourceLineNo">144</span> *     &lt;td&gt;<a name="line.144"></a>
<span class="sourceLineNo">145</span> *       {@link ListIterator#set(Object) ListIterator.set(E)}&lt;br/&gt;<a name="line.145"></a>
<span class="sourceLineNo">146</span> *       {@link #clear()}<a name="line.146"></a>
<span class="sourceLineNo">147</span> *     &lt;/td&gt;<a name="line.147"></a>
<span class="sourceLineNo">148</span> *     &lt;td style="text-align:center;" colspan="3"&gt;&lt;i&gt;O(1)&lt;/i&gt;&lt;/td&gt;<a name="line.148"></a>
<span class="sourceLineNo">149</span> *   &lt;/tr&gt;<a name="line.149"></a>
<span class="sourceLineNo">150</span> *   &lt;tr&gt;<a name="line.150"></a>
<span class="sourceLineNo">151</span> *     &lt;td&gt;<a name="line.151"></a>
<span class="sourceLineNo">152</span> *       {@link #contains(Object) contains(Object)}&lt;br/&gt;<a name="line.152"></a>
<span class="sourceLineNo">153</span> *       {@link #indexOf(Object) indexOf(Object)}&lt;br/&gt;<a name="line.153"></a>
<span class="sourceLineNo">154</span> *       {@link #lastIndexOf(Object)}&lt;br/&gt;<a name="line.154"></a>
<span class="sourceLineNo">155</span> *       {@link #remove(Object) remove(Object)}<a name="line.155"></a>
<span class="sourceLineNo">156</span> *     &lt;/td&gt;<a name="line.156"></a>
<span class="sourceLineNo">157</span> *     &lt;td style="text-align:center;" rowspan="4" colspan="3"&gt;&lt;i&gt;O(n)&lt;/i&gt;&lt;/td&gt;<a name="line.157"></a>
<span class="sourceLineNo">158</span> * &lt;/table&gt;<a name="line.158"></a>
<span class="sourceLineNo">159</span> * &lt;p&gt;<a name="line.159"></a>
<span class="sourceLineNo">160</span> * The {@code subList} views exhibit identical time complexity, with the<a name="line.160"></a>
<span class="sourceLineNo">161</span> * exception of the {@code clear()} operation which runs in linear time<a name="line.161"></a>
<span class="sourceLineNo">162</span> * proportional to the size of the view.<a name="line.162"></a>
<span class="sourceLineNo">163</span> * <a name="line.163"></a>
<span class="sourceLineNo">164</span> * @author Zhenya Leonov<a name="line.164"></a>
<span class="sourceLineNo">165</span> * @param &lt;E&gt;<a name="line.165"></a>
<span class="sourceLineNo">166</span> *            the type of elements maintained by this list<a name="line.166"></a>
<span class="sourceLineNo">167</span> */<a name="line.167"></a>
<span class="sourceLineNo">168</span>public final class RankList&lt;E&gt; extends AbstractList&lt;E&gt; implements List&lt;E&gt;,<a name="line.168"></a>
<span class="sourceLineNo">169</span>                Serializable, Cloneable {<a name="line.169"></a>
<span class="sourceLineNo">170</span><a name="line.170"></a>
<span class="sourceLineNo">171</span>        private static final long serialVersionUID = 1L;<a name="line.171"></a>
<span class="sourceLineNo">172</span>        private static final double P = .5;<a name="line.172"></a>
<span class="sourceLineNo">173</span>        private static final int MAX_LEVEL = 32;<a name="line.173"></a>
<span class="sourceLineNo">174</span>        private transient int size = 0;<a name="line.174"></a>
<span class="sourceLineNo">175</span>        private transient int level = 1;<a name="line.175"></a>
<span class="sourceLineNo">176</span>        private transient Random random = new Random();<a name="line.176"></a>
<span class="sourceLineNo">177</span>        private transient Node&lt;E&gt; head = new Node&lt;E&gt;(null, MAX_LEVEL);<a name="line.177"></a>
<span class="sourceLineNo">178</span><a name="line.178"></a>
<span class="sourceLineNo">179</span>        private RankList() {<a name="line.179"></a>
<span class="sourceLineNo">180</span>                for (int i = 0; i &lt; MAX_LEVEL; i++) {<a name="line.180"></a>
<span class="sourceLineNo">181</span>                        head.next[i] = head;<a name="line.181"></a>
<span class="sourceLineNo">182</span>                        head.dist[i] = 1;<a name="line.182"></a>
<span class="sourceLineNo">183</span>                }<a name="line.183"></a>
<span class="sourceLineNo">184</span>                head.prev = head;<a name="line.184"></a>
<span class="sourceLineNo">185</span>        }<a name="line.185"></a>
<span class="sourceLineNo">186</span><a name="line.186"></a>
<span class="sourceLineNo">187</span>        /**<a name="line.187"></a>
<span class="sourceLineNo">188</span>         * Creates a new {@code RankList}.<a name="line.188"></a>
<span class="sourceLineNo">189</span>         * <a name="line.189"></a>
<span class="sourceLineNo">190</span>         * @return a new {@code RankList}<a name="line.190"></a>
<span class="sourceLineNo">191</span>         */<a name="line.191"></a>
<span class="sourceLineNo">192</span>        public static &lt;E&gt; RankList&lt;E&gt; create() {<a name="line.192"></a>
<span class="sourceLineNo">193</span>                return new RankList&lt;E&gt;();<a name="line.193"></a>
<span class="sourceLineNo">194</span>        }<a name="line.194"></a>
<span class="sourceLineNo">195</span><a name="line.195"></a>
<span class="sourceLineNo">196</span>        /**<a name="line.196"></a>
<span class="sourceLineNo">197</span>         * Creates a new {@code RankList} containing the elements of the specified<a name="line.197"></a>
<span class="sourceLineNo">198</span>         * {@code Iterable}.<a name="line.198"></a>
<span class="sourceLineNo">199</span>         * <a name="line.199"></a>
<span class="sourceLineNo">200</span>         * @param elements<a name="line.200"></a>
<span class="sourceLineNo">201</span>         *            the iterable whose elements are to be placed into the list<a name="line.201"></a>
<span class="sourceLineNo">202</span>         * @return a new {@code RankList} containing the elements of the specified<a name="line.202"></a>
<span class="sourceLineNo">203</span>         *         iterable<a name="line.203"></a>
<span class="sourceLineNo">204</span>         */<a name="line.204"></a>
<span class="sourceLineNo">205</span>        public static &lt;E&gt; RankList&lt;E&gt; create(final Iterable&lt;? extends E&gt; elements) {<a name="line.205"></a>
<span class="sourceLineNo">206</span>                checkNotNull(elements);<a name="line.206"></a>
<span class="sourceLineNo">207</span>                RankList&lt;E&gt; list = new RankList&lt;E&gt;();<a name="line.207"></a>
<span class="sourceLineNo">208</span>                Iterables.addAll(list, elements);<a name="line.208"></a>
<span class="sourceLineNo">209</span>                return list;<a name="line.209"></a>
<span class="sourceLineNo">210</span>        }<a name="line.210"></a>
<span class="sourceLineNo">211</span><a name="line.211"></a>
<span class="sourceLineNo">212</span>        // /**<a name="line.212"></a>
<span class="sourceLineNo">213</span>        // * Creates a {@code RankList} containing the specified initial elements.<a name="line.213"></a>
<span class="sourceLineNo">214</span>        // *<a name="line.214"></a>
<span class="sourceLineNo">215</span>        // * @param elements<a name="line.215"></a>
<span class="sourceLineNo">216</span>        // * the elements to be placed into the list<a name="line.216"></a>
<span class="sourceLineNo">217</span>        // * @return a {@code RankList} containing the specified initial elements<a name="line.217"></a>
<span class="sourceLineNo">218</span>        // */<a name="line.218"></a>
<span class="sourceLineNo">219</span>        // public static &lt;E&gt; RankList&lt;E&gt; create(final E... elements) {<a name="line.219"></a>
<span class="sourceLineNo">220</span>        // checkNotNull(elements);<a name="line.220"></a>
<span class="sourceLineNo">221</span>        // RankList&lt;E&gt; rankList = RankList.create();<a name="line.221"></a>
<span class="sourceLineNo">222</span>        // Collections.addAll(rankList, elements);<a name="line.222"></a>
<span class="sourceLineNo">223</span>        // return rankList;<a name="line.223"></a>
<span class="sourceLineNo">224</span>        // }<a name="line.224"></a>
<span class="sourceLineNo">225</span><a name="line.225"></a>
<span class="sourceLineNo">226</span>        @Override<a name="line.226"></a>
<span class="sourceLineNo">227</span>        public Iterator&lt;E&gt; iterator() {<a name="line.227"></a>
<span class="sourceLineNo">228</span>                return listIterator();<a name="line.228"></a>
<span class="sourceLineNo">229</span>        }<a name="line.229"></a>
<span class="sourceLineNo">230</span><a name="line.230"></a>
<span class="sourceLineNo">231</span>        @Override<a name="line.231"></a>
<span class="sourceLineNo">232</span>        public int size() {<a name="line.232"></a>
<span class="sourceLineNo">233</span>                return size;<a name="line.233"></a>
<span class="sourceLineNo">234</span>        }<a name="line.234"></a>
<span class="sourceLineNo">235</span><a name="line.235"></a>
<span class="sourceLineNo">236</span>        @Override<a name="line.236"></a>
<span class="sourceLineNo">237</span>        public void add(int index, E element) {<a name="line.237"></a>
<span class="sourceLineNo">238</span>                checkPositionIndex(index, size);<a name="line.238"></a>
<span class="sourceLineNo">239</span>                Node&lt;E&gt; curr = head;<a name="line.239"></a>
<span class="sourceLineNo">240</span>                int pos = 0;<a name="line.240"></a>
<span class="sourceLineNo">241</span>                final int newLevel = randomLevel();<a name="line.241"></a>
<span class="sourceLineNo">242</span>                final Node&lt;E&gt; newNode = new Node&lt;E&gt;(element, newLevel);<a name="line.242"></a>
<span class="sourceLineNo">243</span>                if (newLevel &gt; level) {<a name="line.243"></a>
<span class="sourceLineNo">244</span>                        for (int i = level; i &lt; newLevel; i++)<a name="line.244"></a>
<span class="sourceLineNo">245</span>                                head.dist[i] = size + 1;<a name="line.245"></a>
<span class="sourceLineNo">246</span>                        level = newLevel;<a name="line.246"></a>
<span class="sourceLineNo">247</span>                }<a name="line.247"></a>
<span class="sourceLineNo">248</span>                for (int i = level - 1; i &gt;= 0; i--) {<a name="line.248"></a>
<span class="sourceLineNo">249</span>                        while (pos + curr.dist[i] &lt;= index) {<a name="line.249"></a>
<span class="sourceLineNo">250</span>                                pos += curr.dist[i];<a name="line.250"></a>
<span class="sourceLineNo">251</span>                                curr = curr.next[i];<a name="line.251"></a>
<span class="sourceLineNo">252</span>                        }<a name="line.252"></a>
<span class="sourceLineNo">253</span>                        if (i &gt; newLevel - 1)<a name="line.253"></a>
<span class="sourceLineNo">254</span>                                curr.dist[i]++;<a name="line.254"></a>
<span class="sourceLineNo">255</span>                        else {<a name="line.255"></a>
<span class="sourceLineNo">256</span>                                newNode.next[i] = curr.next[i];<a name="line.256"></a>
<span class="sourceLineNo">257</span>                                curr.next[i] = newNode;<a name="line.257"></a>
<span class="sourceLineNo">258</span>                                newNode.dist[i] = pos + curr.dist[i] - index;<a name="line.258"></a>
<span class="sourceLineNo">259</span>                                curr.dist[i] = index + 1 - pos;<a name="line.259"></a>
<span class="sourceLineNo">260</span>                        }<a name="line.260"></a>
<span class="sourceLineNo">261</span>                }<a name="line.261"></a>
<span class="sourceLineNo">262</span>                newNode.prev = curr;<a name="line.262"></a>
<span class="sourceLineNo">263</span>                newNode.next[0].prev = newNode;<a name="line.263"></a>
<span class="sourceLineNo">264</span>                modCount++;<a name="line.264"></a>
<span class="sourceLineNo">265</span>                size++;<a name="line.265"></a>
<span class="sourceLineNo">266</span>        }<a name="line.266"></a>
<span class="sourceLineNo">267</span><a name="line.267"></a>
<span class="sourceLineNo">268</span>        @Override<a name="line.268"></a>
<span class="sourceLineNo">269</span>        public E get(int index) {<a name="line.269"></a>
<span class="sourceLineNo">270</span>                checkElementIndex(index, size);<a name="line.270"></a>
<span class="sourceLineNo">271</span>                return search(index).element;<a name="line.271"></a>
<span class="sourceLineNo">272</span><a name="line.272"></a>
<span class="sourceLineNo">273</span>        }<a name="line.273"></a>
<span class="sourceLineNo">274</span><a name="line.274"></a>
<span class="sourceLineNo">275</span>        @Override<a name="line.275"></a>
<span class="sourceLineNo">276</span>        public int lastIndexOf(Object o) {<a name="line.276"></a>
<span class="sourceLineNo">277</span>                Node&lt;E&gt; node = head;<a name="line.277"></a>
<span class="sourceLineNo">278</span>                for (int i = size - 1; i &gt;= 0; i--) {<a name="line.278"></a>
<span class="sourceLineNo">279</span>                        node = node.prev;<a name="line.279"></a>
<span class="sourceLineNo">280</span>                        if (Objects.equal(node.element, o))<a name="line.280"></a>
<span class="sourceLineNo">281</span>                                return i;<a name="line.281"></a>
<span class="sourceLineNo">282</span>                }<a name="line.282"></a>
<span class="sourceLineNo">283</span>                return -1;<a name="line.283"></a>
<span class="sourceLineNo">284</span>        }<a name="line.284"></a>
<span class="sourceLineNo">285</span><a name="line.285"></a>
<span class="sourceLineNo">286</span>        @Override<a name="line.286"></a>
<span class="sourceLineNo">287</span>        public ListIterator&lt;E&gt; listIterator() {<a name="line.287"></a>
<span class="sourceLineNo">288</span>                return new ListItor();<a name="line.288"></a>
<span class="sourceLineNo">289</span>        }<a name="line.289"></a>
<span class="sourceLineNo">290</span><a name="line.290"></a>
<span class="sourceLineNo">291</span>        @Override<a name="line.291"></a>
<span class="sourceLineNo">292</span>        public ListIterator&lt;E&gt; listIterator(int index) {<a name="line.292"></a>
<span class="sourceLineNo">293</span>                checkPositionIndex(index, size);<a name="line.293"></a>
<span class="sourceLineNo">294</span>                return new ListItor(index);<a name="line.294"></a>
<span class="sourceLineNo">295</span>        }<a name="line.295"></a>
<span class="sourceLineNo">296</span><a name="line.296"></a>
<span class="sourceLineNo">297</span>        @SuppressWarnings("unchecked")<a name="line.297"></a>
<span class="sourceLineNo">298</span>        @Override<a name="line.298"></a>
<span class="sourceLineNo">299</span>        public E remove(int index) {<a name="line.299"></a>
<span class="sourceLineNo">300</span>                checkElementIndex(index, size);<a name="line.300"></a>
<span class="sourceLineNo">301</span>                final Node&lt;E&gt;[] update = new Node[level];<a name="line.301"></a>
<span class="sourceLineNo">302</span>                Node&lt;E&gt; node = head;<a name="line.302"></a>
<span class="sourceLineNo">303</span>                int pos = 0;<a name="line.303"></a>
<span class="sourceLineNo">304</span>                for (int i = level - 1; i &gt;= 0; i--) {<a name="line.304"></a>
<span class="sourceLineNo">305</span>                        while (pos + node.dist[i] &lt;= index) {<a name="line.305"></a>
<span class="sourceLineNo">306</span>                                pos += node.dist[i];<a name="line.306"></a>
<span class="sourceLineNo">307</span>                                node = node.next[i];<a name="line.307"></a>
<span class="sourceLineNo">308</span>                        }<a name="line.308"></a>
<span class="sourceLineNo">309</span>                        update[i] = node;<a name="line.309"></a>
<span class="sourceLineNo">310</span>                }<a name="line.310"></a>
<span class="sourceLineNo">311</span>                node = node.next[0];<a name="line.311"></a>
<span class="sourceLineNo">312</span>                delete(node, update);<a name="line.312"></a>
<span class="sourceLineNo">313</span>                return node.element;<a name="line.313"></a>
<span class="sourceLineNo">314</span>        }<a name="line.314"></a>
<span class="sourceLineNo">315</span><a name="line.315"></a>
<span class="sourceLineNo">316</span>        @Override<a name="line.316"></a>
<span class="sourceLineNo">317</span>        public void clear() {<a name="line.317"></a>
<span class="sourceLineNo">318</span>                for (int i = 0; i &lt; MAX_LEVEL; i++) {<a name="line.318"></a>
<span class="sourceLineNo">319</span>                        head.next[i] = head;<a name="line.319"></a>
<span class="sourceLineNo">320</span>                        head.dist[i] = 1;<a name="line.320"></a>
<span class="sourceLineNo">321</span>                }<a name="line.321"></a>
<span class="sourceLineNo">322</span>                head.prev = head;<a name="line.322"></a>
<span class="sourceLineNo">323</span>                modCount++;<a name="line.323"></a>
<span class="sourceLineNo">324</span>                size = 0;<a name="line.324"></a>
<span class="sourceLineNo">325</span>        }<a name="line.325"></a>
<span class="sourceLineNo">326</span><a name="line.326"></a>
<span class="sourceLineNo">327</span>        @Override<a name="line.327"></a>
<span class="sourceLineNo">328</span>        public E set(int index, E element) {<a name="line.328"></a>
<span class="sourceLineNo">329</span>                checkElementIndex(index, size);<a name="line.329"></a>
<span class="sourceLineNo">330</span>                Node&lt;E&gt; node = search(index);<a name="line.330"></a>
<span class="sourceLineNo">331</span>                E e = node.element;<a name="line.331"></a>
<span class="sourceLineNo">332</span>                node.element = element;<a name="line.332"></a>
<span class="sourceLineNo">333</span>                return e;<a name="line.333"></a>
<span class="sourceLineNo">334</span>        }<a name="line.334"></a>
<span class="sourceLineNo">335</span><a name="line.335"></a>
<span class="sourceLineNo">336</span>        /**<a name="line.336"></a>
<span class="sourceLineNo">337</span>         * Returns a shallow copy of this {@code RankList}. The elements themselves<a name="line.337"></a>
<span class="sourceLineNo">338</span>         * are not cloned.<a name="line.338"></a>
<span class="sourceLineNo">339</span>         * <a name="line.339"></a>
<span class="sourceLineNo">340</span>         * @return a shallow copy of this list<a name="line.340"></a>
<span class="sourceLineNo">341</span>         */<a name="line.341"></a>
<span class="sourceLineNo">342</span>        @SuppressWarnings("unchecked")<a name="line.342"></a>
<span class="sourceLineNo">343</span>        @Override<a name="line.343"></a>
<span class="sourceLineNo">344</span>        public RankList&lt;E&gt; clone() {<a name="line.344"></a>
<span class="sourceLineNo">345</span>                RankList&lt;E&gt; clone;<a name="line.345"></a>
<span class="sourceLineNo">346</span>                try {<a name="line.346"></a>
<span class="sourceLineNo">347</span>                        clone = (RankList&lt;E&gt;) super.clone();<a name="line.347"></a>
<span class="sourceLineNo">348</span>                } catch (java.lang.CloneNotSupportedException e) {<a name="line.348"></a>
<span class="sourceLineNo">349</span>                        throw new InternalError();<a name="line.349"></a>
<span class="sourceLineNo">350</span>                }<a name="line.350"></a>
<span class="sourceLineNo">351</span>                for (int i = 0; i &lt; MAX_LEVEL; i++) {<a name="line.351"></a>
<span class="sourceLineNo">352</span>                        clone.head.next[i] = clone.head;<a name="line.352"></a>
<span class="sourceLineNo">353</span>                        clone.head.dist[i] = 1;<a name="line.353"></a>
<span class="sourceLineNo">354</span>                }<a name="line.354"></a>
<span class="sourceLineNo">355</span>                clone.head.prev = clone.head;<a name="line.355"></a>
<span class="sourceLineNo">356</span>                clone.random = new Random();<a name="line.356"></a>
<span class="sourceLineNo">357</span>                clone.level = 1;<a name="line.357"></a>
<span class="sourceLineNo">358</span>                clone.modCount = 0;<a name="line.358"></a>
<span class="sourceLineNo">359</span>                clone.size = 0;<a name="line.359"></a>
<span class="sourceLineNo">360</span>                clone.addAll(this);<a name="line.360"></a>
<span class="sourceLineNo">361</span>                return clone;<a name="line.361"></a>
<span class="sourceLineNo">362</span>        }<a name="line.362"></a>
<span class="sourceLineNo">363</span><a name="line.363"></a>
<span class="sourceLineNo">364</span>        private void writeObject(java.io.ObjectOutputStream oos)<a name="line.364"></a>
<span class="sourceLineNo">365</span>                        throws java.io.IOException {<a name="line.365"></a>
<span class="sourceLineNo">366</span>                oos.defaultWriteObject();<a name="line.366"></a>
<span class="sourceLineNo">367</span>                oos.writeInt(size);<a name="line.367"></a>
<span class="sourceLineNo">368</span>                for (E e : this)<a name="line.368"></a>
<span class="sourceLineNo">369</span>                        oos.writeObject(e);<a name="line.369"></a>
<span class="sourceLineNo">370</span>        }<a name="line.370"></a>
<span class="sourceLineNo">371</span><a name="line.371"></a>
<span class="sourceLineNo">372</span>        @SuppressWarnings("unchecked")<a name="line.372"></a>
<span class="sourceLineNo">373</span>        private void readObject(java.io.ObjectInputStream ois)<a name="line.373"></a>
<span class="sourceLineNo">374</span>                        throws java.io.IOException, ClassNotFoundException {<a name="line.374"></a>
<span class="sourceLineNo">375</span>                ois.defaultReadObject();<a name="line.375"></a>
<span class="sourceLineNo">376</span>                head = new Node&lt;E&gt;(null, MAX_LEVEL);<a name="line.376"></a>
<span class="sourceLineNo">377</span>                for (int i = 0; i &lt; MAX_LEVEL; i++) {<a name="line.377"></a>
<span class="sourceLineNo">378</span>                        head.next[i] = head;<a name="line.378"></a>
<span class="sourceLineNo">379</span>                        head.dist[i] = 1;<a name="line.379"></a>
<span class="sourceLineNo">380</span>                }<a name="line.380"></a>
<span class="sourceLineNo">381</span>                head.prev = head;<a name="line.381"></a>
<span class="sourceLineNo">382</span>                random = new Random();<a name="line.382"></a>
<span class="sourceLineNo">383</span>                level = 1;<a name="line.383"></a>
<span class="sourceLineNo">384</span>                int size = ois.readInt();<a name="line.384"></a>
<span class="sourceLineNo">385</span>                for (int i = 0; i &lt; size; i++)<a name="line.385"></a>
<span class="sourceLineNo">386</span>                        add((E) ois.readObject());<a name="line.386"></a>
<span class="sourceLineNo">387</span>        }<a name="line.387"></a>
<span class="sourceLineNo">388</span><a name="line.388"></a>
<span class="sourceLineNo">389</span>        private class ListItor implements ListIterator&lt;E&gt; {<a name="line.389"></a>
<span class="sourceLineNo">390</span>                private Node&lt;E&gt; node;<a name="line.390"></a>
<span class="sourceLineNo">391</span>                private Node&lt;E&gt; last = null;<a name="line.391"></a>
<span class="sourceLineNo">392</span>                private int offset;<a name="line.392"></a>
<span class="sourceLineNo">393</span>                private int index = 0;<a name="line.393"></a>
<span class="sourceLineNo">394</span>                private int expectedModCount = modCount;<a name="line.394"></a>
<span class="sourceLineNo">395</span><a name="line.395"></a>
<span class="sourceLineNo">396</span>                private ListItor() {<a name="line.396"></a>
<span class="sourceLineNo">397</span>                        node = head.next[0];<a name="line.397"></a>
<span class="sourceLineNo">398</span>                        offset = 0;<a name="line.398"></a>
<span class="sourceLineNo">399</span>                }<a name="line.399"></a>
<span class="sourceLineNo">400</span><a name="line.400"></a>
<span class="sourceLineNo">401</span>                private ListItor(final int index) {<a name="line.401"></a>
<span class="sourceLineNo">402</span>                        node = search(index);<a name="line.402"></a>
<span class="sourceLineNo">403</span>                        offset = index;<a name="line.403"></a>
<span class="sourceLineNo">404</span>                }<a name="line.404"></a>
<span class="sourceLineNo">405</span><a name="line.405"></a>
<span class="sourceLineNo">406</span>                @Override<a name="line.406"></a>
<span class="sourceLineNo">407</span>                public void add(E element) {<a name="line.407"></a>
<span class="sourceLineNo">408</span>                        checkForConcurrentModification();<a name="line.408"></a>
<span class="sourceLineNo">409</span>                        RankList.this.add(index++ + offset, element);<a name="line.409"></a>
<span class="sourceLineNo">410</span>                        expectedModCount = modCount;<a name="line.410"></a>
<span class="sourceLineNo">411</span>                        last = null;<a name="line.411"></a>
<span class="sourceLineNo">412</span>                        node = node.next[0];<a name="line.412"></a>
<span class="sourceLineNo">413</span>                }<a name="line.413"></a>
<span class="sourceLineNo">414</span><a name="line.414"></a>
<span class="sourceLineNo">415</span>                @Override<a name="line.415"></a>
<span class="sourceLineNo">416</span>                public boolean hasNext() {<a name="line.416"></a>
<span class="sourceLineNo">417</span>                        return index + offset &lt; size();<a name="line.417"></a>
<span class="sourceLineNo">418</span>                }<a name="line.418"></a>
<span class="sourceLineNo">419</span><a name="line.419"></a>
<span class="sourceLineNo">420</span>                @Override<a name="line.420"></a>
<span class="sourceLineNo">421</span>                public boolean hasPrevious() {<a name="line.421"></a>
<span class="sourceLineNo">422</span>                        return index + offset &gt; 0;<a name="line.422"></a>
<span class="sourceLineNo">423</span>                }<a name="line.423"></a>
<span class="sourceLineNo">424</span><a name="line.424"></a>
<span class="sourceLineNo">425</span>                @Override<a name="line.425"></a>
<span class="sourceLineNo">426</span>                public E next() {<a name="line.426"></a>
<span class="sourceLineNo">427</span>                        checkForConcurrentModification();<a name="line.427"></a>
<span class="sourceLineNo">428</span>                        if (!hasNext())<a name="line.428"></a>
<span class="sourceLineNo">429</span>                                throw new NoSuchElementException();<a name="line.429"></a>
<span class="sourceLineNo">430</span>                        index++;<a name="line.430"></a>
<span class="sourceLineNo">431</span>                        last = node;<a name="line.431"></a>
<span class="sourceLineNo">432</span>                        node = node.next[0];<a name="line.432"></a>
<span class="sourceLineNo">433</span>                        return last.element;<a name="line.433"></a>
<span class="sourceLineNo">434</span>                }<a name="line.434"></a>
<span class="sourceLineNo">435</span><a name="line.435"></a>
<span class="sourceLineNo">436</span>                @Override<a name="line.436"></a>
<span class="sourceLineNo">437</span>                public int nextIndex() {<a name="line.437"></a>
<span class="sourceLineNo">438</span>                        return index + offset;<a name="line.438"></a>
<span class="sourceLineNo">439</span>                }<a name="line.439"></a>
<span class="sourceLineNo">440</span><a name="line.440"></a>
<span class="sourceLineNo">441</span>                @Override<a name="line.441"></a>
<span class="sourceLineNo">442</span>                public E previous() {<a name="line.442"></a>
<span class="sourceLineNo">443</span>                        checkForConcurrentModification();<a name="line.443"></a>
<span class="sourceLineNo">444</span>                        if (index == 0)<a name="line.444"></a>
<span class="sourceLineNo">445</span>                                throw new NoSuchElementException();<a name="line.445"></a>
<span class="sourceLineNo">446</span>                        index--;<a name="line.446"></a>
<span class="sourceLineNo">447</span>                        last = node = node.prev;<a name="line.447"></a>
<span class="sourceLineNo">448</span>                        return node.element;<a name="line.448"></a>
<span class="sourceLineNo">449</span>                }<a name="line.449"></a>
<span class="sourceLineNo">450</span><a name="line.450"></a>
<span class="sourceLineNo">451</span>                @Override<a name="line.451"></a>
<span class="sourceLineNo">452</span>                public int previousIndex() {<a name="line.452"></a>
<span class="sourceLineNo">453</span>                        return index + offset - 1;<a name="line.453"></a>
<span class="sourceLineNo">454</span>                }<a name="line.454"></a>
<span class="sourceLineNo">455</span><a name="line.455"></a>
<span class="sourceLineNo">456</span>                @Override<a name="line.456"></a>
<span class="sourceLineNo">457</span>                public void remove() {<a name="line.457"></a>
<span class="sourceLineNo">458</span>                        checkForConcurrentModification();<a name="line.458"></a>
<span class="sourceLineNo">459</span>                        checkState(last != null);<a name="line.459"></a>
<span class="sourceLineNo">460</span>                        RankList.this.remove(--index + offset);<a name="line.460"></a>
<span class="sourceLineNo">461</span>                        expectedModCount = modCount;<a name="line.461"></a>
<span class="sourceLineNo">462</span>                        last = null;<a name="line.462"></a>
<span class="sourceLineNo">463</span>                }<a name="line.463"></a>
<span class="sourceLineNo">464</span><a name="line.464"></a>
<span class="sourceLineNo">465</span>                @Override<a name="line.465"></a>
<span class="sourceLineNo">466</span>                public void set(E element) {<a name="line.466"></a>
<span class="sourceLineNo">467</span>                        checkForConcurrentModification();<a name="line.467"></a>
<span class="sourceLineNo">468</span>                        checkState(last != null);<a name="line.468"></a>
<span class="sourceLineNo">469</span>                        last.element = element;<a name="line.469"></a>
<span class="sourceLineNo">470</span>                }<a name="line.470"></a>
<span class="sourceLineNo">471</span><a name="line.471"></a>
<span class="sourceLineNo">472</span>                private void checkForConcurrentModification() {<a name="line.472"></a>
<span class="sourceLineNo">473</span>                        if (expectedModCount != modCount)<a name="line.473"></a>
<span class="sourceLineNo">474</span>                                throw new ConcurrentModificationException();<a name="line.474"></a>
<span class="sourceLineNo">475</span>                }<a name="line.475"></a>
<span class="sourceLineNo">476</span>        }<a name="line.476"></a>
<span class="sourceLineNo">477</span><a name="line.477"></a>
<span class="sourceLineNo">478</span>        // skip list<a name="line.478"></a>
<span class="sourceLineNo">479</span><a name="line.479"></a>
<span class="sourceLineNo">480</span>        private static class Node&lt;E&gt; {<a name="line.480"></a>
<span class="sourceLineNo">481</span>                private E element;<a name="line.481"></a>
<span class="sourceLineNo">482</span>                private Node&lt;E&gt; prev;<a name="line.482"></a>
<span class="sourceLineNo">483</span>                private final Node&lt;E&gt;[] next;<a name="line.483"></a>
<span class="sourceLineNo">484</span>                private final int[] dist;<a name="line.484"></a>
<span class="sourceLineNo">485</span><a name="line.485"></a>
<span class="sourceLineNo">486</span>                @SuppressWarnings("unchecked")<a name="line.486"></a>
<span class="sourceLineNo">487</span>                private Node(final E element, final int size) {<a name="line.487"></a>
<span class="sourceLineNo">488</span>                        this.element = element;<a name="line.488"></a>
<span class="sourceLineNo">489</span>                        next = new Node[size];<a name="line.489"></a>
<span class="sourceLineNo">490</span>                        dist = new int[size];<a name="line.490"></a>
<span class="sourceLineNo">491</span>                }<a name="line.491"></a>
<span class="sourceLineNo">492</span>        }<a name="line.492"></a>
<span class="sourceLineNo">493</span><a name="line.493"></a>
<span class="sourceLineNo">494</span>        private Node&lt;E&gt; search(final int index) {<a name="line.494"></a>
<span class="sourceLineNo">495</span>                Node&lt;E&gt; curr = head;<a name="line.495"></a>
<span class="sourceLineNo">496</span>                int pos = -1;<a name="line.496"></a>
<span class="sourceLineNo">497</span>                for (int i = level - 1; i &gt;= 0; i--)<a name="line.497"></a>
<span class="sourceLineNo">498</span>                        while (pos + curr.dist[i] &lt;= index) {<a name="line.498"></a>
<span class="sourceLineNo">499</span>                                pos = pos + curr.dist[i];<a name="line.499"></a>
<span class="sourceLineNo">500</span>                                curr = curr.next[i];<a name="line.500"></a>
<span class="sourceLineNo">501</span>                        }<a name="line.501"></a>
<span class="sourceLineNo">502</span>                return curr;<a name="line.502"></a>
<span class="sourceLineNo">503</span>        }<a name="line.503"></a>
<span class="sourceLineNo">504</span><a name="line.504"></a>
<span class="sourceLineNo">505</span>        private void delete(final Node&lt;E&gt; node, final Node&lt;E&gt;[] update) {<a name="line.505"></a>
<span class="sourceLineNo">506</span>                node.next[0].prev = node.prev;<a name="line.506"></a>
<span class="sourceLineNo">507</span>                for (int i = 0; i &lt; level; i++)<a name="line.507"></a>
<span class="sourceLineNo">508</span>                        if (update[i].next[i] == node) {<a name="line.508"></a>
<span class="sourceLineNo">509</span>                                update[i].next[i] = node.next[i];<a name="line.509"></a>
<span class="sourceLineNo">510</span>                                update[i].dist[i] += node.dist[i] - 1;<a name="line.510"></a>
<span class="sourceLineNo">511</span>                        } else<a name="line.511"></a>
<span class="sourceLineNo">512</span>                                update[i].dist[i]--;<a name="line.512"></a>
<span class="sourceLineNo">513</span>                while (head.next[level - 1] == head &amp;&amp; level &gt; 1)<a name="line.513"></a>
<span class="sourceLineNo">514</span>                        level--;<a name="line.514"></a>
<span class="sourceLineNo">515</span>                modCount++;<a name="line.515"></a>
<span class="sourceLineNo">516</span>                size--;<a name="line.516"></a>
<span class="sourceLineNo">517</span>        }<a name="line.517"></a>
<span class="sourceLineNo">518</span><a name="line.518"></a>
<span class="sourceLineNo">519</span>        private int randomLevel() {<a name="line.519"></a>
<span class="sourceLineNo">520</span>                int randomLevel = 1;<a name="line.520"></a>
<span class="sourceLineNo">521</span>                while (randomLevel &lt; MAX_LEVEL - 1 &amp;&amp; random.nextDouble() &lt; P)<a name="line.521"></a>
<span class="sourceLineNo">522</span>                        randomLevel++;<a name="line.522"></a>
<span class="sourceLineNo">523</span>                return randomLevel;<a name="line.523"></a>
<span class="sourceLineNo">524</span>        }<a name="line.524"></a>
<span class="sourceLineNo">525</span><a name="line.525"></a>
<span class="sourceLineNo">526</span>}<a name="line.526"></a>




























































</pre>
</div>
</body>
</html>
